Network Estimation via Graphon With Node Features
نویسندگان
چکیده
منابع مشابه
Dynamic network models and graphon estimation
In the present paper we consider a dynamic stochastic network model. The objective is estimation of the tensor of connection probabilities Λ when it is generated by a Dynamic Stochastic Block Model (DSBM) or a dynamic graphon. In particular, in the context of DSBM, we derive penalized least squares estimator Λ̂ of Λ and show that Λ̂ satisfies an oracle inequality and also attains minimax lower bo...
متن کاملRate - Optimal Graphon Estimation
Network analysis is becoming one of the most active research areas in statistics. Significant advances have been made recently on developing theories, methodologies and algorithms for analyzing networks. However, there has been little fundamental study on optimal estimation. In this paper, we establish optimal rate of convergence for graphon estimation. For the stochastic block model with k clu...
متن کاملOracle inequalities for network models and sparse graphon estimation
Inhomogeneous random graph models encompass many network models such as stochastic block models and latent position models. We consider the problem of statistical estimation of the matrix of connection probabilities based on the observations of the adjacency matrix of the network. Taking the stochastic block model as an approximation, we construct estimators of network connection probabilities ...
متن کاملPrivate Graphon Estimation for Sparse Graphs
We design algorithms for fitting a high-dimensional statistical model to a large, sparse network without revealing sensitive information of individual members. Given a sparse input graph G, our algorithms output a node-differentially private nonparametric block model approximation. By node-differentially private, we mean that our output hides the insertion or removal of a vertex and all its adj...
متن کاملRates of Convergence of Spectral Methods for Graphon Estimation
This paper studies the problem of estimating the grahpon model – the underlying generating mechanism of a network. Graphon estimation arises in many applications such as predicting missing links in networks and learning user preferences in recommender systems. The graphon model deals with a random graph of n vertices such that each pair of two vertices i and j are connected independently with p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2020
ISSN: 2327-4697,2334-329X
DOI: 10.1109/tnse.2020.2973994